An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up and Delivery with Time Windows

Vehicle Routing Problem (VRP) has many applications in real systems, especially distribution and transportation. The optimal determination of vehicle routes impacts increasing economic interests. This research aims to find the solution Pick-up Delivery with Time Windows (VRPPDTW). Targets this problem included reducing distance travel penalties. Three penalties that were considered are a capacity penalty, opening time capacity, closing capacity. An improved genetic algorithm was developed used determine route. There one main depot 42 customers. raised shipping logistics company. Analysis results showed proposed route obtained from algorithms (GA) better than existing previous algorithm. Besides, carried out an analysis on effect number iterations traveled, penalties, fitness value. could be applied VRPPDTW produces solution.